dm.ieu.edu.tr
Course Name | |
Code | Semester | Theory (hour/week) | Application/Lab (hour/week) | Local Credits | ECTS |
---|---|---|---|---|---|
Fall/Spring |
Prerequisites | None | |||||
Course Language | ||||||
Course Type | Elective | |||||
Course Level | - | |||||
Mode of Delivery | - | |||||
Teaching Methods and Techniques of the Course | ||||||
Course Coordinator | - | |||||
Course Lecturer(s) | ||||||
Assistant(s) | - |
Course Objectives | |
Learning Outcomes | The students who succeeded in this course;
|
Course Description |
| Core Courses | |
Major Area Courses | X | |
Supportive Courses | ||
Media and Managment Skills Courses | ||
Transferable Skill Courses |
Week | Subjects | Required Materials |
1 | Graphs and Digraphs | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004. |
2 | Common families of graphs | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
3 | Graph Modeling Applications | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
4 | Walks and Distance, Paths, Cycles, and Trees | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
5 | Subgraphs. Some Graphs Operations. | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
6 | Midterm Exam | |
7 | Graph Isomorphism.Representations., | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
8 | Trees: Rooted Trees, Binary Trees | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
9 | Catalan Recursion, Traversing a Binary Trees, Spanning Trees | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
10 | Vertex/Edge Connectivity. Constructing Reliable Networks. | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
11 | MaxMin Duality and Menger’s Theorems. Eulerian Trails and Tours. | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
12 | Hamiltonian Paths and Cycles. Traveling Salesman Problem | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
13 | Vertex and Edge Coloring | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
14 | Map Coloring and Mathematica Applications | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004 |
15 | Review for final exam | |
16 | Review of the Semester |
Course Notes/Textbooks | R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson, 2004. Part 3 |
Suggested Readings/Materials | Graph Theory: Modeling, Applications, and Algorithms, by Geir Agnarsson and Raymond Greenlaw, Pearson Prentice Hall, 2007. |
Semester Activities | Number | Weigthing |
Participation | 1 | 5 |
Laboratory / Application | ||
Field Work | ||
Quizzes / Studio Critiques | ||
Portfolio | ||
Homework / Assignments | ||
Presentation / Jury | 1 | 5 |
Project | 1 | 10 |
Seminar / Workshop | ||
Oral Exam | ||
Midterm | 1 | 40 |
Final Exam | 1 | 40 |
Total |
Weighting of Semester Activities on the Final Grade | 60 | |
Weighting of End-of-Semester Activities on the Final Grade | 40 | |
Total |
Semester Activities | Number | Duration (Hours) | Workload |
---|---|---|---|
Course Hours (Including exam week: 16 x total hours) | 16 | 3 | 48 |
Laboratory / Application Hours (Including exam week: 16 x total hours) | 16 | ||
Study Hours Out of Class | 10 | 5 | |
Field Work | |||
Quizzes / Studio Critiques | |||
Portfolio | |||
Homework / Assignments | |||
Presentation / Jury | 1 | 6 | |
Project | 1 | 6 | |
Seminar / Workshop | |||
Oral Exam | |||
Midterms | 1 | 20 | |
Final Exams | 1 | 20 | |
Total | 150 |
# | Program Competencies/Outcomes | * Contribution Level | ||||
1 | 2 | 3 | 4 | 5 | ||
1 | To have a grasp of basic mathematics, applied mathematics and theories and applications of statistics. | X | ||||
2 | To be able to use theoretical and applied knowledge acquired in the advanced fields of mathematics and statistics, | X | ||||
3 | To be able to define and analyze problems and to find solutions based on scientific methods, | X | ||||
4 | To be able to apply mathematics and statistics in real life with interdisciplinary approach and to discover their potentials, | X | ||||
5 | To be able to acquire necessary information and to make modeling in any field that mathematics is used and to improve herself/himself, | X | ||||
6 | To be able to criticize and renew her/his own models and solutions, | X | ||||
7 | To be able to tell theoretical and technical information easily to both experts in detail and nonexperts in basic and comprehensible way, | X | ||||
8 | To be able to use international resources in English and in a second foreign language from the European Language Portfolio (at the level of B1) effectively and to keep knowledge up-to-date, to communicate comfortably with colleagues from Turkey and other countries, to follow periodic literature, | X | ||||
9 | To be familiar with computer programs used in the fields of mathematics and statistics and to be able to use at least one of them effectively at the European Computer Driving Licence Advanced Level, | X | ||||
10 | To be able to behave in accordance with social, scientific and ethical values in each step of the projects involved and to be able to introduce and apply projects in terms of civic engagement, | X | ||||
11 | To be able to evaluate all processes effectively and to have enough awareness about quality management by being conscious and having intellectual background in the universal sense, | X | ||||
12 | By having a way of abstract thinking, to be able to connect concrete events and to transfer solutions, to be able to design experiments, collect data, and analyze results by scientific methods and to interfere, | X | ||||
13 | To be able to continue lifelong learning by renewing the knowledge, the abilities and the compentencies which have been developed during the program, and being conscious about lifelong learning, | X | ||||
14 | To be able to adapt and transfer the knowledge gained in the areas of mathematics and statistics to the level of secondary school, | X | ||||
15 | To be able to conduct a research either as an individual or as a team member, and to be effective in each related step of the project, to take role in the decision process, to plan and manage the project by using time effectively. | X |
*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest